Fast Exact Evaluation of Univariate Kernel Sums

نویسندگان

چکیده

This paper presents new methodology for computationally efficient evaluation of univariate kernel sums. It is shown that a rich class kernels allows exact functions expressed as sum using simple recursions. Given an ordered sample the computational complexity linear in size. Direct applications to estimation denisties and their derivatives shows proposed approach competitive with state-of-the-art. Extensions multivariate problems including independent component analysis spatial smoothing illustrate versatility estimators, highlight efficiency accuracy approach. Multiple image processing, deconvolution; denoising; reconstruction are considered, showing offers very promising potential these fields.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Exact Max-Kernel Search

The wide applicability of kernels makes the problem of max-kernel search ubiquitous and more general than the usual similarity search in metric spaces. We focus on solving this problem efficiently. We begin by characterizing the inherent hardness of the max-kernel search problem with a novel notion of directional concentration. Following that, we present a method to use an O(n log n) algorithm ...

متن کامل

Dual-tree fast exact max-kernel search

The problem of max-kernel search arises everywhere: given a query point pq , a set of reference objects Sr and some kernel K, find arg maxpr∈Sr K(pq , pr ). Max-kernel search is ubiquitous and appears in countless domains of science, thanks to the wide applicability of kernels. A few domains include image matching, information retrieval, bio-informatics, similarity search, and collaborative fil...

متن کامل

Fast evaluation of multiple zeta sums

We show that the multiple zeta sum: ζ(s1, s2, ..., sd) = ∑ n1>n2>...>nd 1 n1 1 n s2 2 ...n sd d , for positive integers si with s1 > 1, can always be written as a finite sum of products of rapidly convergent series. Perhaps surprisingly, one may develop fast summation algorithms of such efficiency that the overall complexity can be brought down essentially to that of one-dimensional summation. ...

متن کامل

Distributive lattices with strong endomorphism kernel property as direct sums

Unbounded distributive lattices which have strong endomorphism kernel property (SEKP) introduced by Blyth and Silva in [3] were fully characterized in [11] using Priestley duality (see Theorem  2.8}). We shall determine the structure of special elements (which are introduced after  Theorem 2.8 under the name strong elements) and show that these lattices can be considered as a direct product of ...

متن کامل

Univariate Algebraic Kernel and Application to Arrangements

We present a cgal-based univariate algebraic kernel, which provides certi ed real-root isolation of univariate polynomials with integer coe cients and standard functionalities such as basic arithmetic operations, greatest common divisor (gcd) and square-free factorization, as well as comparison and sign evaluations of real algebraic numbers. We compare our kernel with other comparable kernels, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence

سال: 2021

ISSN: ['1939-3539', '2160-9292', '0162-8828']

DOI: https://doi.org/10.1109/tpami.2019.2930501